Storing and restoring visual input with collaborative rank coding and associative memory

نویسندگان

  • Martin Rehn
  • Friedrich T. Sommer
چکیده

Associative memory in cortical circuits has been held as a major mechanism for content-addressable memory. Hebbian synapses implement associative memory efficiently when storing sparse binary activity patterns. However, in models of sensory processing, representations are graded and not binary. Thus, it has been an unresolved question how sensory computation could exploit cortical associative memory. Here we propose a way how sensory processing could benefit from memory in cortical circuitry. We describe a new collaborative method of rank coding for converting graded stimuli, such as natural images, into sequences of synchronous spike volleys. Such sequences of sparse binary patterns can be efficiently processed in associative memory of the Willshaw type. We evaluate storage capacity and noise tolerance of the proposed system and demonstrate its use in cleanup and fill-in for noisy or occluded visual input. r 2006 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Object Recognition in Image Sequences and Robust Associative Image Memory using the Multilevel Hypermap Architecture

The introduced system for object recognition and tracking uses an associative memory for storing prototypes of objects. The Multilevel Hypermap Architecture (MHA), a self-organizing neural network approach, is used, to construct a robust system. To process form variant objects the MHA is extended to work with masked input data. Because of using scaled input objects, the system is invariant to t...

متن کامل

Recalling of Images using Hopfield Neural Network Model

In the present paper, an effort has been made for storing and recalling images with Hopfield Neural Network Model of auto-associative memory. Images are stored by calculating a corresponding weight matrix. Thereafter, starting from an arbitrary configuration, the memory will settle on exactly that stored image, which is nearest to the starting configuration in terms of Hamming distance. Thus gi...

متن کامل

Huffman Coding for Storing Non-Uniformly Distributed Messages in Networks of Neural Cliques

Associative memories are data structures that allow retrieval of previously stored messages given part of their content. They thus behave similarly to human brain’s memory that is capable for instance of retrieving the end of a song given its beginning. Among different families of associative memories, sparse ones are known to provide the best efficiency (ratio of the number of bits stored to t...

متن کامل

The technique of in-place associative sorting

In the first place, a novel, yet straightforward in-place integer value-sorting algorithm is presented. It sorts in linear time using constant amount of additional memory for storing counters and indices beside the input array. The technique is inspired from the principal idea behind one of the ordinal theories of “serial order in behavior” and explained by the analogy with the three main stage...

متن کامل

Effective And Optimal Storage of Memory Patterns With Variable Coding Levels

This paper studies the storage of memory patterns with varying coding levels (fraction of firing neurons within a pattern) in an associative memory network. It was previously shown that effective memory storage (that scales with the network’s size) requires that the synaptic modification rule used during learning explicitly depends on the coding level of the stored memory patterns. We show that...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Neurocomputing

دوره 69  شماره 

صفحات  -

تاریخ انتشار 2006